A Genetic Algorithm to Schedule Workflow Collections on a SOA-Grid with Communication Costs

نویسندگان

  • Jean-Marc Nicod
  • Lamiel Toch
چکیده

In this paper we study the problem of scheduling a collection of workflows, identical or not, on a SOA grid. A workflow (job) is represented by a directed acyclic graph (DAG) with typed tasks. All of the grid hosts are able to process a set of task types with unrelated processing costs and are able to transmit files through communication links for which the communication times are not negligible. The goal is to minimize the maximum completion time (makespan) of the workflows. To solve this problem we propose a genetic approach. The contributions of this paper are both the design of a Genetic Algorithm taking the communication costs into account and the performance analysis. Key-words: Batch scheduling, grid computing, heterogeneous platform, genetic algorithm Laboratoire d’Informatique de l’Université de Franche-Comté, UFR Sciences et Techniques, 16, route de Gray, 25030 Besançon Cedex (France) Téléphone : +33 (0)3 81 66 64 55 — Télécopie : +33 (0)3 81 66 64 50 Algorithme Génétique pour Ordonnancer un Ensemble de Workflow sur une Grille Orientée Service avec des Coûts de Communications Résumé : Dans ce rapport de recherche nous considérons un problème pour ordonnancer un ensemble de workflows, identiques ou non, sur une grille fondée sur une architecture orientée service. Un workflow (job) est représenté par un graph acyclique orienté avec un des tâches typées. Chacune des machines de la grille savent exécuter un ensemble de type de tâches prédéfinies avec des coûts indépendants les uns des autres. L’objectif est de minimiser la date de fin de la derniére tâche (le makespan) de l’ensemble de workflows. Pour résoudre ce probléme nous proposons une approche génétique. Nous apportons une contributions à la fois dans la conception d’un algorithme génétique prenant les coûts de communication en compte et dans les analyses des performances. Mots-clés : Ordonnancement de lots, grille de calcul, plateforme hétérogène, algorithme génétique Laboratoire d’Informatique de l’Université de Franche-Comté, UFR Sciences et Techniques, 16, route de Gray, 25030 Besançon Cedex (France) Téléphone : +33 (0)3 81 66 64 55 — Télécopie : +33 (0)3 81 66 64 50 A GA to Schedule Workflow Collections with Communication Costs 7

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Architectural Plan for Constructing Fault Tolerable Workflow Engines Based on Grid Service

In this paper the design and implementation of fault tolerable architecture for scientific workflow engines is presented. The engines are assumed to be implemented as composite web services. Current architectures for workflow engines do not make any considerations for substituting faulty web services with correct ones at run time. The difficulty is to rollback the execution state of the workflo...

متن کامل

Architectural Plan for Constructing Fault Tolerable Workflow Engines Based on Grid Service

In this paper the design and implementation of fault tolerable architecture for scientific workflow engines is presented. The engines are assumed to be implemented as composite web services. Current architectures for workflow engines do not make any considerations for substituting faulty web services with correct ones at run time. The difficulty is to rollback the execution state of the workflo...

متن کامل

Multi-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids

 To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...

متن کامل

Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms

Grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models, which are capable of supporting diverse computing services. It facilitates scientific applications to take advantage of computing resources distributed world wide to enhance the capability and performance. Many scientific applications in areas s...

متن کامل

Transient Analysis of the Single-Conductor Overhead Lines Connected to Grid-Grounded Arrester under Direct Lightning by Means of GA

In this paper, genetic algorithm-based approach for transient analysis of single transmission line connected to arrester is proposed. In this approach, the lightning channel striking the overhead line is first represented by a current source and this source is truncated by a finite set of frequency harmonies in time domain. Norton equivalent circuit viewed across arrester is then computed by me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011